Geometry and dynamics for hierarchical regular networks
نویسندگان
چکیده
منابع مشابه
Hierarchical regular small-world networks
Two new networks are introduced that resemble small-world properties. These networks are recursively constructed but retain a fixed, regular degree. They possess a unique one-dimensional lattice backbone overlaid by a hierarchical sequence of long-distance links, mixing real-space and small-world features. Both networks, one 3-regular and the other 4-regular, lead to distinct behaviors, as reve...
متن کاملCollective Dynamics of Hierarchical Networks
In an increasingly complex, mobile and interconnected world, we face growing threats of disasters, whether by chance or deliberately. Disruption of coordinated response and recovery efforts due to organizational, technical, procedural, random or deliberate attack could result in the risk of massive loss of life. This requires urgent action to explore the development of optimal information-shari...
متن کاملMENNAG: a modular, regular and hierarchical encoding for neural-networks based on attribute grammars
Recent work in the evolutionary computation field suggests that the implementation of the principles of modularity (functional localization of functions), repetition (multiple use of the same sub-structure) and hierarchy (recursive composition of sub-structures) could improve the evolvability of complex systems. The generation of neural networks through evolutionary algorithms should in particu...
متن کاملSingle Assignment Capacitated Hierarchical Hub Set Covering Problem for Service Delivery Systems Over Multilevel Networks
The present study introduced a novel hierarchical hub set covering problem with capacity constraints. This study showed the significance of fixed charge costs for locating facilities, assigning hub links and designing a productivity network. The proposed model employs mixed integer programming to locate facilities and establish links between nodes according to the travel time between an origin-...
متن کاملHierarchical Shape-Adaptive Quantization for Geometry Compression
The compression of polygonal mesh geometry is still an active field of research as in 3d no theoretical bounds are known. This work proposes a geometry coding method based on predictive coding. Instead of using the vertex to vertex distance as distortion measurement, an approximation to the Hausdorffdistance is used resulting in additional degrees of freedom. These are exploited by a new adapti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2008
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/41/33/335003